edge transitive graph meaning in Chinese
边可迁图
Examples
- In the first chapter , the background and some basic results are introduced . in the second chapter , we study higher order edge connectivity , and obtained ( a ) except for three graphs , all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs , all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs , in particular , necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given
第二章中，我们研究高阶边连通度，得到了如下结果： ( a )除了三个特殊图外，所有具有有限跃阶的无限循环图都是超边连通的； ( b )除了三种特殊图类外，所有边传递图都是最优- ~ ( 3 )图； ( c )刻划了点传递图的最优- ~ ( 3 )性，特别是给出了cayley图和极小cayley图为最优- ~ ( 3 )图的充分必要条件； ( d )给出了一个图(不一定是对称图)是最优- ~ ( 3 )图的一种充分条件。 - In chapter three , we study graphs with higher order vertex connectedness and ( a ) a characterization of edge transitive graphs which are super - connected or hyper - connected is given ; ( b ) a new measure of network reliability , semi - hyper - connectedness , is proposed , and edge transitive graphs which are semi - hyper - connected are characterized
在第三章中，我们研究高阶点连通性，得到如下结果： ( a )刻划了边传递图的super -性和hyper -性； ( b )定义了一种新的网络可靠性度量标准： semi - hyper -性，并给出了边传递图为semi - hyper -图的充要条件。